Optimal Scaling of Generalized and Polynomial Eigenvalue Problems

نویسنده

  • Timo Betcke
چکیده

Scaling is a commonly used technique for standard eigenvalue problems to improve the sensitivity of the eigenvalues. In this paper we investigate scaling for generalized and polynomial eigenvalue problems (PEPs) of arbitrary degree. It is shown that an optimal diagonal scaling of a PEP with respect to an eigenvalue can be described by the ratio of its normwise and componentwise condition number. Furthermore, the effect of linearization on optimally scaled polynomials is investigated. We introduce a generalization of the diagonal scaling by Lemonnier and Van Dooren to PEPs that is especially effective if some information about the magnitude of the wanted eigenvalues is available and also discuss variable transformations of the type λ = αμ for PEPs of arbitrary degree.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multilevel Jacobi--Davidson Method for Polynomial PDE Eigenvalue Problems Arising in Plasma Physics

The simulation of drift instabilities in the plasma edge leads to cubic polynomial PDE eigenvalue problems with parameter dependent coefficients. The aim is to determine the wave number which leads to the maximum growth rate of the amplitude of the wave. This requires the solution of a large number of PDE eigenvalue problems. Since we are only interested in a smooth eigenfunction corresponding ...

متن کامل

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

متن کامل

The Conditioning of Linearizations of Matrix Polynomials

The standard way of solving the polynomial eigenvalue problem of degree m in n×n matrices is to “linearize” to a pencil in mn×mn matrices and solve the generalized eigenvalue problem. For a given polynomial, P , infinitely many linearizations exist and they can have widely varying eigenvalue condition numbers. We investigate the conditioning of linearizations from a vector space DL(P ) of penci...

متن کامل

Non Linear Eigenvalue Problems

In this paper we consider generalized eigenvalue problems for a family of operators with a polynomial dependence on a complex parameter. This problem is equivalent to a genuine non self-adjoint operator. We discuss here existence of non trivial eigenstates for models coming from analytic theory of smoothness for P.D.E. We shall review some old results and present recent improvements on this sub...

متن کامل

A Numerical Approach for Fractional Optimal Control Problems by Using Ritz Approximation

In this article, Ritz approximation have been employed to obtain the numerical solutions of a class of the fractional optimal control problems based on the Caputo fractional derivative. Using polynomial basis functions, we obtain a system of nonlinear algebraic equations. This nonlinear system of equation is solved and the coefficients of basis polynomial are derived. The convergence of the num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2008